Defining New Universes in Many-sorted Logic. *
نویسندگان
چکیده
In this paper we develop definability theory in such a way that we allow to define new elements also, not only new relations on already existing elements. This is in harmony with our everyday mathematical practice, for example we define new entities when we define a geometry over a field. We will see that, in many respects, defining new elements is more harmonious in many-sorted logic than in one-sorted logic. In the first part of the paper we develop definability theory allowing to define new entities in many-sorted logic (this will amount to defining new universes i.e. new sorts), and in the second part of the paper we develop such a definability theory in one-sorted logic (where this will amount to enlarge the universe with newly defined elements). We will prove an analogon of Beth's definability theorem in this extended context, i.e. we will prove the coincidence of implicit and explicit definability, both in the many-sorted and in the one-sorted case.
منابع مشابه
Qualitative Logic for 'Generally'
We examine logical systems with generalized quantifiers, for expressing and reasoning about assertions with 'generally'. The primary motivation is a qualitative, rather than quantitative, approach to some vague notions. Assertions and arguments involving notions, such as 'generally', 'most', 'many', etc., occur often in ordinary language and in some branches of science. Filters can be used for ...
متن کاملOn the Completeness Theorem of Many-sorted Equational Logic and the Equivalence between Hall Algebras and Bénabou Theories
The completeness theorem of equational logic of Birkhoff asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for many-sorted deduction, founded ultimately on the congruences on Hall algebras, generalized the completeness theorem of Birkhoff to the completeness theorem of many-sorted ...
متن کاملThe Completeness Theorem for Monads in Categories of Sorted Sets
Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for finitary many-sorted equational deduction, generalized the completeness theorem of Birkhoff to the completeness of finitary many-sorted equational logic and provided simultaneo...
متن کاملExistential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (called sort-hierarchy). However, this logic cannot represent more complex sorted expressions when they are true in any possible world (as rigid) or some possible worlds (as modality) such as time, space, belief, or situ...
متن کاملUniverses for Generic Programs and Proofs in Dependent Type Theory
We show how to write generic programs and proofs in MartinLöf type theory. To this end we consider several extensions of MartinLöf’s logical framework for dependent types. Each extension has a universes of codes (signatures) for inductively defined sets with generic formation, introduction, elimination, and equality rules. These extensions are modeled on Dybjer and Setzer’s finitely axiomatized...
متن کامل